#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 1e6 + 5;

int n, m;
int tr[N][26], tot;
int num[N];

void insert(string s) {
  int p = 0;
  for (char c : s) {
    int ch = c - 'a';
    if (!tr[p][ch]) tr[p][ch] = ++tot;
    p = tr[p][ch];
  }
  num[p]++;
}
int query(string s) {
  int p = 0, ans = 0;
  for (char c : s) {
    int ch = c - 'a';
    if (!tr[p][ch]) break;
    p = tr[p][ch];
    ans += num[p];
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m;
  rep(i, 1, n) {
    string s;
    cin >> s;
    insert(s);
  }
  rep(i, 1, m) {
    string s;
    cin >> s;
    cout << query(s) << endl;
  }
  return 0;
}